0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n004.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 02:23:20 EDT 2022
0.13/0.35	% CPUTime    : 
0.20/0.48	Running higher-order on 8 cores theorem proving
0.20/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.48	# Version: 3.0pre003-ho
0.20/0.51	# Preprocessing class: HSSSSMSSSSSNHHA.
0.20/0.51	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting sh2lt with 480s (4) cores
0.20/0.51	# Starting new_ho_10_unif with 120s (1) cores
0.20/0.51	# Starting full_lambda_6 with 120s (1) cores
0.20/0.51	# Starting post_as_ho1 with 120s (1) cores
0.20/0.51	# Starting ehoh_best3_rw with 120s (1) cores
0.20/0.51	# sh2lt with pid 20825 completed with status 0
0.20/0.51	# Result found by sh2lt
0.20/0.51	# Preprocessing class: HSSSSMSSSSSNHHA.
0.20/0.51	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting sh2lt with 480s (4) cores
0.20/0.51	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.20/0.51	# ...ProofStateSinE()=1/1
0.20/0.51	# Search class: HGHNF-FFSF11-SHHFFMBN
0.20/0.51	# Scheduled 6 strats onto 4 cores with 480 seconds (480 total)
0.20/0.51	# Starting ehoh_best_nonlift with 260s (1) cores
0.20/0.51	# Starting sh2lt with 49s (1) cores
0.20/0.51	# Starting ehoh_best_sine_rwall with 44s (1) cores
0.20/0.51	# Starting lpo1_def_fix with 44s (1) cores
0.20/0.51	# sh2lt with pid 20834 completed with status 0
0.20/0.51	# Result found by sh2lt
0.20/0.51	# Preprocessing class: HSSSSMSSSSSNHHA.
0.20/0.51	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting sh2lt with 480s (4) cores
0.20/0.51	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.20/0.51	# ...ProofStateSinE()=1/1
0.20/0.51	# Search class: HGHNF-FFSF11-SHHFFMBN
0.20/0.51	# Scheduled 6 strats onto 4 cores with 480 seconds (480 total)
0.20/0.51	# Starting ehoh_best_nonlift with 260s (1) cores
0.20/0.51	# Starting sh2lt with 49s (1) cores
0.20/0.51	# Preprocessing time       : 0.001 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_22, type, epred1_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.51	thf(decl_23, type, epred2_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.51	thf(decl_24, type, epred3_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.51	thf(decl_25, type, esk1_1: (($i > $o) > ($i > $o) > $o) > $i).
0.20/0.51	thf(decl_26, type, epred4_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.51	thf(decl_27, type, epred5_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.51	thf(decl_28, type, epred6_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.51	thf(decl_29, type, esk2_0: $i).
0.20/0.51	thf(decl_30, type, esk3_0: $i).
0.20/0.51	thf(decl_31, type, esk4_0: $i).
0.20/0.51	thf(decl_32, type, esk5_0: $i).
0.20/0.51	thf(decl_33, type, esk6_0: $i).
0.20/0.51	thf(decl_34, type, esk7_0: $i).
0.20/0.51	thf(decl_35, type, esk8_0: $i).
0.20/0.51	thf(cTHM120I_pme, conjecture, ?[X1:($i > $o) > ($i > $o) > $o]:(((![X2:$i > $o]:((X1 @ X2 @ X2))&![X3:$i > $o, X4:$i > $o]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X3))=>![X5:$i]:(((X4 @ X5)<=>(X3 @ X5))))))&![X2:$i > $o, X6:$i > $o, X7:$i > $o]:(((X1 @ X2 @ X7)<=((X1 @ X2 @ X6)&(X1 @ X6 @ X7)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM120I_pme)).
0.20/0.51	thf(c_0_1, negated_conjecture, ~(?[X1:($i > $o) > ($i > $o) > $o]:(((![X2:$i > $o]:((X1 @ X2 @ X2))&![X3:$i > $o, X4:$i > $o]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X3))=>![X5:$i]:(((X4 @ X5)<=>(X3 @ X5))))))&![X2:$i > $o, X6:$i > $o, X7:$i > $o]:((((X1 @ X2 @ X6)&(X1 @ X6 @ X7))=>(X1 @ X2 @ X7)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM120I_pme])])).
0.20/0.51	thf(c_0_2, negated_conjecture, ![X16:($i > $o) > ($i > $o) > $o]:(((((((X16 @ (epred4_1 @ X16) @ (epred5_1 @ X16))|((X16 @ (epred2_1 @ X16) @ (epred3_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16))))&((X16 @ (epred5_1 @ X16) @ (epred6_1 @ X16))|((X16 @ (epred2_1 @ X16) @ (epred3_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))&(~(X16 @ (epred4_1 @ X16) @ (epred6_1 @ X16))|((X16 @ (epred2_1 @ X16) @ (epred3_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))&((((X16 @ (epred4_1 @ X16) @ (epred5_1 @ X16))|((X16 @ (epred3_1 @ X16) @ (epred2_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16))))&((X16 @ (epred5_1 @ X16) @ (epred6_1 @ X16))|((X16 @ (epred3_1 @ X16) @ (epred2_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))&(~(X16 @ (epred4_1 @ X16) @ (epred6_1 @ X16))|((X16 @ (epred3_1 @ X16) @ (epred2_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16))))))&(((((X16 @ (epred4_1 @ X16) @ (epred5_1 @ X16))|(~(epred3_1 @ X16 @ (esk1_1 @ X16))|~(epred2_1 @ X16 @ (esk1_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16))))&((X16 @ (epred5_1 @ X16) @ (epred6_1 @ X16))|(~(epred3_1 @ X16 @ (esk1_1 @ X16))|~(epred2_1 @ X16 @ (esk1_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))&(~(X16 @ (epred4_1 @ X16) @ (epred6_1 @ X16))|(~(epred3_1 @ X16 @ (esk1_1 @ X16))|~(epred2_1 @ X16 @ (esk1_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))&((((X16 @ (epred4_1 @ X16) @ (epred5_1 @ X16))|((epred3_1 @ X16 @ (esk1_1 @ X16))|(epred2_1 @ X16 @ (esk1_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16))))&((X16 @ (epred5_1 @ X16) @ (epred6_1 @ X16))|((epred3_1 @ X16 @ (esk1_1 @ X16))|(epred2_1 @ X16 @ (esk1_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))&(~(X16 @ (epred4_1 @ X16) @ (epred6_1 @ X16))|((epred3_1 @ X16 @ (esk1_1 @ X16))|(epred2_1 @ X16 @ (esk1_1 @ X16))|~(X16 @ (epred1_1 @ X16) @ (epred1_1 @ X16)))))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
0.20/0.51	thf(c_0_3, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|~((X1 @ (epred4_1 @ X1) @ (epred6_1 @ X1)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_4, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred5_1 @ X1) @ (epred6_1 @ X1))|(X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_5, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred4_1 @ X1) @ (epred5_1 @ X1))|(X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_6, negated_conjecture, (((epred2_1 @ $eq)=(epred3_1 @ $eq))|((epred6_1 @ $eq)!=(epred4_1 @ $eq))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_3])).
0.20/0.51	thf(c_0_7, negated_conjecture, (((epred6_1 @ $eq)=(epred5_1 @ $eq))|((epred2_1 @ $eq)=(epred3_1 @ $eq))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_4])).
0.20/0.51	thf(c_0_8, negated_conjecture, (((epred5_1 @ $eq)=(epred4_1 @ $eq))|((epred2_1 @ $eq)=(epred3_1 @ $eq))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_5])).
0.20/0.51	thf(c_0_9, negated_conjecture, ((epred2_1 @ $eq)=(epred3_1 @ $eq)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])).
0.20/0.51	thf(c_0_10, negated_conjecture, ![X49:$i]:(((epred2_1 @ $eq @ X49)<=>(epred3_1 @ $eq @ X49))), inference(arg_cong,[status(thm)],[c_0_9])).
0.20/0.51	thf(c_0_11, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:((~((X1 @ (epred4_1 @ X1) @ (epred6_1 @ X1)))|~((epred3_1 @ X1 @ (esk1_1 @ X1)))|~((epred2_1 @ X1 @ (esk1_1 @ X1)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_12, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred4_1 @ X1) @ (epred5_1 @ X1))|~((epred3_1 @ X1 @ (esk1_1 @ X1)))|~((epred2_1 @ X1 @ (esk1_1 @ X1)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_13, negated_conjecture, ![X5:$i]:(((epred3_1 @ $eq @ X5)|~((epred2_1 @ $eq @ X5)))), inference(dynamic cnf,[status(thm)],[c_0_10])).
0.20/0.51	thf(c_0_14, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((epred3_1 @ X1 @ (esk1_1 @ X1))|(epred2_1 @ X1 @ (esk1_1 @ X1))|~((X1 @ (epred4_1 @ X1) @ (epred6_1 @ X1)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_15, negated_conjecture, ![X5:$i]:(((epred2_1 @ $eq @ X5)|~((epred3_1 @ $eq @ X5)))), inference(dynamic cnf,[status(thm)],[c_0_10])).
0.20/0.51	thf(c_0_16, negated_conjecture, (((epred6_1 @ $eq)!=(epred4_1 @ $eq))|~((epred2_1 @ $eq @ (esk1_1 @ $eq)))|~((epred3_1 @ $eq @ (esk1_1 @ $eq)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_11])).
0.20/0.51	thf(c_0_17, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred5_1 @ X1) @ (epred6_1 @ X1))|~((epred3_1 @ X1 @ (esk1_1 @ X1)))|~((epred2_1 @ X1 @ (esk1_1 @ X1)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_18, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred4_1 @ X1) @ (epred5_1 @ X1))|(epred3_1 @ X1 @ (esk1_1 @ X1))|(epred2_1 @ X1 @ (esk1_1 @ X1))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_19, negated_conjecture, (((epred5_1 @ $eq)=(epred4_1 @ $eq))|~((epred2_1 @ $eq @ (esk1_1 @ $eq)))), inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_12]), c_0_13])).
0.20/0.51	thf(c_0_20, negated_conjecture, ((epred2_1 @ $eq @ (esk1_1 @ $eq))|((epred6_1 @ $eq)!=(epred4_1 @ $eq))), inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_14]), c_0_15])).
0.20/0.51	thf(c_0_21, negated_conjecture, (((epred6_1 @ $eq)!=(epred4_1 @ $eq))|~((epred3_1 @ $eq @ (esk1_1 @ $eq)))), inference(spm,[status(thm)],[c_0_16, c_0_15])).
0.20/0.51	thf(c_0_22, negated_conjecture, (((epred6_1 @ $eq)=(epred5_1 @ $eq))|~((epred2_1 @ $eq @ (esk1_1 @ $eq)))), inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_17]), c_0_13])).
0.20/0.51	thf(c_0_23, negated_conjecture, ((epred5_1 @ $eq)=(epred4_1 @ $eq)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_18]), c_0_15]), c_0_19])).
0.20/0.51	thf(c_0_24, negated_conjecture, ((epred6_1 @ $eq)!=(epred4_1 @ $eq)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_20]), c_0_21])).
0.20/0.51	thf(c_0_25, negated_conjecture, (((epred6_1 @ $eq)=(epred5_1 @ $eq))|~((epred3_1 @ $eq @ (esk1_1 @ $eq)))), inference(spm,[status(thm)],[c_0_22, c_0_15])).
0.20/0.51	thf(c_0_26, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred5_1 @ X1) @ (epred6_1 @ X1))|(epred3_1 @ X1 @ (esk1_1 @ X1))|(epred2_1 @ X1 @ (esk1_1 @ X1))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.51	thf(c_0_27, negated_conjecture, ~((epred2_1 @ $eq @ (esk1_1 @ $eq))), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
0.20/0.51	thf(c_0_28, negated_conjecture, ~((epred3_1 @ $eq @ (esk1_1 @ $eq))), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_23]), c_0_24])).
0.20/0.51	thf(c_0_29, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_26]), c_0_23]), c_0_24]), c_0_27]), c_0_28]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 1
0.20/0.51	# Removed by relevancy pruning/SinE    : 0
0.20/0.51	# Initial clauses                      : 12
0.20/0.51	# Removed in clause preprocessing      : 0
0.20/0.51	# Initial clauses in saturation        : 12
0.20/0.51	# Processed clauses                    : 180
0.20/0.51	# ...of these trivial                  : 9
0.20/0.51	# ...subsumed                          : 35
0.20/0.51	# ...remaining for further processing  : 135
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 41
0.20/0.51	# Backward-rewritten                   : 14
0.20/0.51	# Generated clauses                    : 287
0.20/0.51	# ...of the previous two non-redundant : 214
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 7
0.20/0.51	# Paramodulations                      : 86
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 7
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 34
0.20/0.51	#    Positive orientable unit clauses  : 2
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 3
0.20/0.51	#    Non-unit-clauses                  : 29
0.20/0.51	# Current number of unprocessed clauses: 52
0.20/0.51	# ...number of literals in the above   : 207
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 101
0.20/0.51	# Clause-clause subsumption calls (NU) : 488
0.20/0.51	# Rec. Clause-clause subsumption calls : 247
0.20/0.51	# Non-unit clause-clause subsumptions  : 62
0.20/0.51	# Unit Clause-clause subsumption calls : 58
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 2
0.20/0.51	# BW rewrite match successes           : 2
0.20/0.51	# Condensation attempts                : 0
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 66802
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.030 s
0.20/0.51	# System time              : 0.002 s
0.20/0.51	# Total time               : 0.032 s
0.20/0.51	# Maximum resident set size: 1848 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.091 s
0.20/0.51	# System time              : 0.005 s
0.20/0.51	# Total time               : 0.095 s
0.20/0.51	# Maximum resident set size: 1708 pages
0.20/0.51	EOF